Experimental study of Elementary Cellular Automata dynamics using the density parameter
نویسنده
چکیده
In [Gut89] Howard Gutowitz writes : “A fundamental problem in theory of cellular automata is classification. A good classification divides cellular automata into groups with meaningfully related properties. In general there are two types of classifications : phenotypic and genotypic. A phenotypic classification divides a population into groups according to their observed behaviour. A genotypic classification divides a population into groups according to the intrinsic structure of the entities in the population.” In 1984, the first phenotypic classification has been proposed by Wolfram [Wol84] dividing cellular automata (CA) according to their “observed dynamics”. This classification was very important since it motivated numerous researches but was at the same time criticised by many authors on grounds that no formal definitions of the classes were given. In 1989, Culik and Yu in [ČPY89] proposed a formal definition of the classes according to some asymptotic behaviour of the cellular automaton and showed the undecidability of the classifying scheme. The class of CA that has drawn much attention is the class of the 256, 2-state 3-neighbours CA, or so-called Elementary CA (ECA). An interesting axis of investigation was the application of topological analysis theory to cellular automata. In 1998, Cattaneo et al. in [CFM99] proposed a genotypic classification of all of the 256 ECA that has the advantage to rely on formal definitions as well as theoretical justifications.
منابع مشابه
A Phase Diagram for Elementary Cellular Automata
We construct a phase diagram for the possible dynamics of one-dimensional, two-state, three-neighbor cellular automaton rules, using a new parameter (in conjunction with the previously known activity parameter). The new parameter 'estimates the average sensitivity of rule outcome to small changes in neighborhood configuration.
متن کاملDynamics of Directed Boolean Networks under Generalized Elementary Cellular Automata Rules, with Power-Law Distributions and Popularity Assignment of Parent Nodes
This study provides an analysis of the dynamics of fixed-size directed Boolean networks governed by generalizations of elementary cellular automata rules 22 and 126, under a power-law distribution of parent nodes and a popularity parent assignment. The analysis shows the existence of a two-piece chaotic attractor for smaller values of the power-law parameter which evolves into a “cloud”-like at...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملSet-theoretic Reconstructability of Elementary Cellular Automata
This paper reports a study of elementary cellular automata (ECA), using the settheoretic reconstructability analysis (SRA) methods of Klir (1985), Conant (1981), Broekstra (1979) , and others. Cellular automata (CA) are discrete dynamic systems, de ned in terms of mappings of qualitative variables, which exhibit the same dynamic behaviors { including chaos { seen in systems of continuous di ere...
متن کاملA Novel Design of a Multi-layer 2:4 Decoder using Quantum- Dot Cellular Automata
The quantum-dot cellular automata (QCA) is considered as an alternative tocomplementary metal oxide semiconductor (CMOS) technology based on physicalphenomena like Coulomb interaction to overcome the physical limitations of thistechnology. The decoder is one of the important components in digital circuits, whichcan be used in more comprehensive circuits such as full adde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003